4 A ug 2 00 6 An Optimal Lookup Table Construction for Charge Division with respect to Efficiency Flatness
نویسندگان
چکیده
Static lookup tables as often used in the position calculation electronics in position sensitive detectors suffer from the well known problem that the propagation of digitization errors in the division leads to unequal efficiencies for the different output channels. In this paper we present a solution to the construction of such a lookup table which is optimal in the sense that the least possible efficiency errors are committed in the class of monotone lookup tables. The obtained resolution is comparable to what is obtained using the standard implementation of the fixed point division. After a theoretical explanation, we present some experimental results confirming our claim.
منابع مشابه
Optimal Power Assignment of Energy Storage Systems to Improve the Energy Storage Efficiency for Frequency Regulation
Losses in energy storage systems (ESSs) are considered operational costs and it is critical to improve efficiency in order to expand their use. We proposed a method of improving efficiency through the operation algorithm of an ESS, consisting of multiple energy storage units (ESUs). Since the ESS used for frequency adjustment maintains a fast response characteristics, we have created a lookup t...
متن کامل2 6 A ug 2 00 5 SUBCOMPLEXES IN CURVED BGG – SEQUENCES
BGG–sequences offer a uniform construction for invariant differential operators for a large class of geometric structures called parabolic geometries. For locally flat geometries, the resulting sequences are complexes, but in general the compositions of the operators in such a sequence are nonzero. In this paper, we show that under appropriate torsion freeness and/or semi–flatness assumptions c...
متن کاملOctopus: Anonymous and Secure DHT Lookup
Distributed Hash Table (DHT) lookup is a core technique in structured peer-to-peer (P2P) networks. Its decentralized nature introduces security and privacy vulnerabilities for applications built on top of them; we thus set out to design a lookup mechanism achieving both security and anonymity, heretofore an open problem. We first explore the essential anonymity vulnerabilities in DHT lookups, a...
متن کاملOptical orthogonal signature pattern codes with maximum collision parameter 2 and weight 4
An optical orthogonal signature pattern code (OOSPC) finds application in transmitting 2-dimensional images through multicore fiber in code-division multiple-access (CDMA) communication systems. Observing a one-to-one correspondence between an OOSPC and a certain combinatorial subject, called a packing design, we present a construction of optimal OOSPCs with weight 4 and maximum collision param...
متن کاملUnderstanding Chord Performance and Topology - aware Overlay Construction for Chord
We studied performance of the Chord scalable lookup system with several performance enhancements. For the denser finger technique, we gave analytical result that shows the average lookup path length decreases slower than the maximum length and converges to it as finger density grows higher. Location cache, as implemented in MIT Chord, is shown to be able to reduce the lookup path length by 1/2 ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008